#include <iostream>
#include <string>

#include <vector>
#include <set>
#include <algorithm> 
using namespace std;


int main() {
	int N, K, M;
	cin >> N >> K >> M;

	vector<int> Ans(N);
	for (int i = 0; i < N; i++) {
		int sum, max, min,score;
		for (int j = 0; j < K; j++) {
			if (j == 0) {
				cin >> score;
				max = score;
				min = score;
				sum = score;
			}
			else {
				cin >> score;
				if (max < score) max = score;
				if (min > score) min = score;
				sum += score;
			}
		}
		sum -= (max + min);
		Ans[i] = sum;
	}

	sort(Ans.begin(), Ans.end());
	K -= 2;
	int time = 0;
	vector<double> A(M);
	for (auto it = Ans.rbegin(); it != Ans.rend();it++) {
		if (time == M) break;
		double ans = (double)(*it) / K;
		A[time] = ans;
		time++;
	}
	time = 0;
	for (auto it = A.rbegin(); it != A.rend(); it++) {
		if (time == 0) printf("%.3f", *it);
		else printf(" %.3f", *it);
		time++;
	}

}
